A Multi-Agent Route Exploration Problem
نویسندگان
چکیده
We investigate a route exploration problem with N agents dropped randomly on the interval [0,b] and discuss the impact of using multiple agents to perform this task. We consider both a discrete and a continous description of the path to explore. Independantly, we study an exploration problem with probabilistic agents having limited autonomy. In both problems , multi-agent scenarios are discussed with an emphasis on the number of agents necessary to obtain good performance.
منابع مشابه
Collaborative Evolutionary Planning Framework (EPF) for Route Planning
This research presents a collaborative evolutionary planning framework for large scale grid exploration and planning problems. It caters for both dynamic and unknown environments using evolutionary techniques. In addition, we integrate the exploration and planning process in a unified framework using multi agent system. As a proof of success, we have developed extensive simulations with realist...
متن کاملA Cognitive Agent-based Model for Multi-Robot Coverage ata City Scale
Background Multi-robot system (MRS) has emerged as a product of cheap sensing and actuating capabilities of small, and moderately sophisticated robots and advancements in distributed problem-solving. In application domains such as sweeping, distribution and exploration of an unknown environment, MRS usually have mobile and autonomous participating robots, performing the task cooperatively. It h...
متن کاملUser-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm
Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...
متن کاملModeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, ...
متن کاملRoute planning model of multi-agent system for a supply chain management
Route planning system could be used as a part of supply chain management information system or as a complete application. The main challenge in route planning system is directing vehicles to their destination in a dynamic traffic situation, with the aim of reducing travel times and enabling the efficient use of the available road capacity in the road transportation network for the supply chain ...
متن کامل